منابع مشابه
Group Mutual Exclusion in Token Rings
The group mutual exclusion (GME) problem was introduced by Joung [6]. The GME solution allows n processes to share m mutually exclusive resources. We first present a group mutual exclusion algorithm (Algorithm GME ) for anonymous token rings. The space requirement and the size of messages of this algorithm depend only on the number of shared resources (O(logm) bits). So, the proposed algorithm ...
متن کاملGroup Mutual Exclusion In Tree Networks
The group mutual exclusion (GME) problem deals with sharing a set of (m) mutually exclusive resources among all (n) processes of a network. Processes are allowed to be in a critical section simultaneously provided they request the same resource. We present three group mutual exclusion solutions for tree networks. All three solutions do not use process identifiers, and use bounded size messages....
متن کاملAsynchronous Group Mutual Exclusion in Ring Networks
The design issues for group mutual exclusion have been modeled by Joung as the Congenial Talking Philosophers, and solutions for shared-memory models and complete message-passing networks have been proposed [2, 3]. These solutions, however, cannot be straightforwardly and efficiently converted to ring networks where each philosopher can only communicate directly with its two neighboring philoso...
متن کاملSelf-stabilizing Mutual Exclusion and Group Mutual Exclusion for Population Protocols with Covering
This paper presents and proves correct two self-stabilizing deterministic algorithms solving the mutual exclusion and the group mutual exclusion problems in the model of population protocols with covering. In this variant of the population protocol model, a local fairness is used and bounded state anonymous mobile agents interact in pairs according to constraints expressed in terms of their cov...
متن کاملSelf-stabilizing Mutual Exclusion and Group Mutual Exclusion for Population Protocols with Covering (Extended Version)
This paper presents and proves correct two self-stabilizing deterministic algorithms solving the mutual exclusion and the group mutual exclusion problems in the model of population protocols with covering. In this variant of the population protocol model, a local fairness is used and bounded state anonymous mobile agents interact in pairs according to constraints expressed in terms of their cov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2018
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.05.030